Storing semi-structured data on disk drives
نویسندگان
چکیده
منابع مشابه
Storing Trees on Disk Drives
Tree-structured data are abundant today, ranging from Bioinformatics suffix-tree alignments, to multi-resolution video, to directory-file hierarchies, to XML. The storage techniques employed by systems that manage tree-structured data greatly affect their performance. Current approaches either map the tree data to an underlying relational database system, or use the abstraction provided by a ge...
متن کاملExtending Semi-Structured Data
The problem of modeling semi structured data is important in many application areas such as multimedia data management biolog ical databases digital libraries and data integration In this paper we base our work on bdfs which is a formal and elegant model for semi structured data where schemas are graphs whose edges are labeled with formulae of a theory T We extend bdfs with the possibility of e...
متن کاملMining Semi-structured Data
The need for discovering knowledge from XML documents according to both structure and content features has become challenging, due to the increase in application contexts for which handling both structure and content information in XML data is essential. So, the challenge is to find an hierarchical structure which ensure a combination of data levels and their representative structures. In this ...
متن کاملQuerying Semi-Structured Data
The amount of data of all kinds available electronically has increased dramatically in recent years. The data resides in di erent forms, ranging from unstructured data in le systems to highly structured in relational database systems. Data is accessible through a variety of interfaces including Web browsers, database query languages, application-speci c interfaces, or data exchange formats. Som...
متن کاملQueries and Constraints on Semi-structured Data
We extend the model for semi-structured data proposed in [4], where both databases and schemas are represented as graphs, with the possibility of expressing different types of constraints on the nodes of the graphs, and defining queries which are used to select graphs from a database. We show that reasoning tasks at the basis of query optimization, such as schema subsumption, query-schema compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Storage
سال: 2009
ISSN: 1553-3077,1553-3093
DOI: 10.1145/1534912.1534915